منابع مشابه
An update on non-Hamiltonian 54-tough maximal planar graphs
Studying the shortness of longest cycles in maximal planar graphs, we improve the upper bound on the shortness exponent of the class of 54 -tough maximal planar graphs presented by Harant and Owens [Discrete Math. 147 (1995), 301–305]. In addition, we present two generalizations of a similar result of Tkáč who considered 1-tough maximal planar graphs [Discrete Math. 154 (1996), 321–328]; we rem...
متن کاملFinding Hamiltonian circuits in quasi-adjoint graphs
This paper is motivated by a method used for DNA sequencing by hybridization presented in [Jacek Blazewicz, Marta Kasprzak, Computational complexity of isothermic DNA sequencing by hybridization, Discrete Appl. Math. 154 (5) (2006) 718–729]. This paper presents a class of digraphs: the quasi-adjoint graphs. This class includes the ones used in the paper cited above. A polynomial recognition alg...
متن کاملAlternating Hamiltonian circuits in edge-coloured bipartite graphs
Hilton, A. J. W., Alternating Hamiltonian circuits in edge-coloured bipartite graphs, Discrete Applied Mathematics 35 (1992) 271-273. We show that if G = K,, is edge-coloured with t-12 colours so that the subgraph induced by the edges of each colour is regular of order 2n, then G has a Hamiltonian circuit in which adjacent edges have different colours. We also give a generalization of this resu...
متن کاملChordality and 2-factors in Tough Graphs
A graph G is chordal if it contains no chordless cycle of length at least four and is k-chordal if a longest chordless cycle in G has length at most k. In this note it is proved that all 2 -tough 5-chordal graphs have a 2-factor. This result is best possible in two ways. Examples due to Chvátal show that for all > 0 there exists a ( 2 − )-tough chordal graph with no 2-factor. Furthermore, examp...
متن کاملHamiltonian Factors in Hamiltonian Graphs
Let G be a Hamiltonian graph. A factor F of G is called a Hamiltonian factor if F contains a Hamiltonian cycle. In this paper, two sufficient conditions are given, which are two neighborhood conditions for a Hamiltonian graph G to have a Hamiltonian factor. Keywords—graph, neighborhood, factor, Hamiltonian factor.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2006
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.03.011